A DECOMPOSITION-BASED ALGORITHM FOR TRAIN TIMETABLING PROBLEM WITH DYNAMIC PASSENGERS' DEMANDS
نویسندگان
چکیده
منابع مشابه
Exact formulations and algorithm for the train timetabling problem with dynamic demand
In this paper we study the design and optimization of train timetabling adapted to a dynamic demand environment. This problem arises in rapid train services which are common in most important cities. We present four formulations for the problem, with the aim of minimizing passenger average waiting time. The first one consists of a mixed integer non-linear programming model in which binary varia...
متن کاملA discrete-event optimization framework for mixed-speed train timetabling problem
Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...
متن کاملPassenger Centric Train Timetabling Problem
The aim of this paper is to analyze and to improve the current planning process of the passenger railway service in light of the recent railway market changes. In order to do so, we introduce the Passenger Centric Train Timetabling Problem. The originality of our approach is that we account for the passenger satisfaction in the design of the timetable. We consider both types of timetable(s): cy...
متن کاملTrain Timetabling Problem for Complex Railway Systems
This paper deals with the design of timetables for complex railway systems. Rail transportation has become a rapid, clean and efficient way to transport passengers and freights. A good timetable design is crucial to ensure the quality of the services trying to improve the efficiency of the whole system. Only such a sustainable transportation system will be in accordance to the requirements of f...
متن کاملA Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem
In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Operations Research Society of Japan
سال: 2021
ISSN: ['1349-8940', '2188-8280']
DOI: https://doi.org/10.15807/torsj.64.101